Truth, Reflection, and Hierarchies

نویسنده

  • Michael Glanzberg
چکیده

A common objection to hierarchical approaches to truth is that they fragment the concept of truth. This paper defends hierarchical approaches in general against the objection of fragmentation. It argues that the fragmentation required is familiar and unproblematic, via a comparison with mathematical proof. Furthermore, it offers an explanation of the source and nature of the fragmentation of truth. Fragmentation arises because the concept exhibits a kind of failure of closure under reflection. This paper offers a more precise characterization of the reflection involved, first in the setting of formal theories of truth, and then in a more general setting. truthprooffinal.tex: January 27, 2003 (12:03) It is often noted that Tarski’s [1935] hierarchy of languages and metalanguages fragments the concept of truth. Instead of one concept, we have infinitely many, arranged in a hierarchy. Subsequent work along Tarskian lines [e.g. Parsons, 1974b; Burge, 1979; Barwise and Etchemendy, 1987] has proposed, in various ways, to base hierarchies on what speakers can express in a given context, rather than on multiple languages or concepts of truth per se. In my own work [2001; MS], I argue that a hierarchy of domains of propositions is in fact generated by the workings of linguistic context. I thus argue that natural language considerations lend some plausibility to a hierarchical approach. But the objection of fragmentation still stands. One way or another, hierarchical theories all require that speakers cannot in any one instance express the entirety of a unified concept of truth. In this essay, I shall defend hierarchical approaches in general against the objection of fragmentation. I shall do so in two ways. First, I shall argue that the fragmentation required is familiar. We see just the same sort of fragmentation in the concept of mathematical proof. In the case of mathematical proof, we find the fragmentation banal, or at least unthreatening, and perhaps even a source of richness of the concept. It is not problematic there, and it is not problematic in the case of truth either. Second, in the course of this argument, I shall attempt to make clearer the source and nature of the fragmentation of these concepts. It has been observed both for proof [Kreisel, 1970] and for truth [Parsons, 1974a,b] that fragmentation arises because these concepts exhibit a kind of failure of closure under reflection. Very roughly, any sufficiently precise articulation of either concept allows for a kind of reflection upon the correctness of that articulation that leads to a distinct, stronger one. I shall here investigate this reflection. Building on the work of Kreisel and Parsons, I shall offer a more precise characterization of it in the setting of formal theories of truth, and I shall show that this helps us to understand the hierarchical nature of the concept of truth in a more general setting. My arguments below will focus on a particularly strong and rarely noticed form of the Liar paradox, which I have dubbed the Fortified Liar paradox. As the Strengthened Liar paradox shows that a natural answer to the Liar paradox leads back to paradox, the Fortified Liar shows that a natural answer to the Strengthened Liar leads back to paradox as well. I shall argue that the Fortified Liar helps to make clear why the concept of truth is hierarchical, and helps explain the sense in which the hierarchy is generated by a process of reflection.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complexity and Hierarchy in Truth Predicates∗

Since seminal work of Tarski (e.g. Tarski, 1935), hierarchies have been much discussed in the literature on truth and paradox. Especially in recent years, this discussion has been decidedly negative. Tarski’s hierarchy of languages is sometimes described as the “orthodox” response to the Liar paradox (e.g. Kripke, 1975), but it is an orthodoxy many authors have gone to great lengths to avoid. F...

متن کامل

Some observations on Truth Hierarchies

We provide a precise representation for, and a calculation of the length of, possible path independent determinateness hierarchies of Field’s construction in [4]. We further show in the hierarchies Fα of Fieldian truth sets, and Herzberger’s Hα revision sequence starting from any recursive hypothesis for F0 (or H0) that essentially each Hα (or Fα) carries within it the history of the whole prio...

متن کامل

A Reflection on Russell's Ramified Types and Kripke's Hierarchy of Truths

Both in Kripke's Theory of Truth ktt 8] and Russell's Ramiied Type Theory rtt 16, 9] we are confronted with some hierarchy. In rtt, we have a double hierarchy of orders and types. That is, the class of propositions is divided into diierent orders where a propositional function can only depend on objects of lower orders and types. Kripke on the other hand, has a ladder of languages where the tru...

متن کامل

Assertional logics, truth-equational logics, and the hierarchies of abstract algebraic logic

We establish some relations between the class of truth-equational logics, the class of assertional logics, other classes in the Leibniz hierarchy, and the classes in the Frege hierarchy. We argue that the class of assertional logics belongs properly in the Leibniz hierarchy. We give two new characterizations of truth-equational logics in terms of their full generalized models, and use them to o...

متن کامل

Ground Truth Energies for Hierarchies of Segmentations

In evaluating a hierarchy of segmentations H of an image by ground truth G, which can be partitions of the space or sets, we look for the optimal partition in H that ”fits” G best. Two energies on partial partitions express the proximity from H to G, and G to H. They derive from a local version of the Hausdorff distance. Then the problem amounts to finding the cut of the hierarchy which minimiz...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Synthese

دوره 142  شماره 

صفحات  -

تاریخ انتشار 2005